solution set 【數學】解集。
【數學】解集。 “solution“ 中文翻譯： n. 1.溶解；溶液，溶體，溶劑。 2.(補輪胎用的)橡 ...“set“ 中文翻譯： vt. (set; setting) 1.放；擱；貼；靠 ...“set solution“ 中文翻譯： 標準溶液“disposable solution infusion set“ 中文翻譯： 用后可棄輸液器“loesungsmenge solution set“ 中文翻譯： 解集“set of feasible solution“ 中文翻譯： 可行解集“solution set of equation“ 中文翻譯： 方程的解集“di osable solution infusion set“ 中文翻譯： 用后可棄輸液器“a solution“ 中文翻譯： 從未準時的解決方案“a-solution“ 中文翻譯： 素仙露“at-solution“ 中文翻譯： 雙氫速甾醇溶液“in solution“ 中文翻譯： 溶解著; 在溶解狀態中, 在不斷變化中, 動搖不定“solution“ 中文翻譯： n. 1.溶解；溶液，溶體，溶劑。 2.(補輪胎用的)橡膠水；〔美國〕藥水。 3.解決，解答 (of; for; to); 解釋；(數學等的)解法，解式。 4.免除，解除。 5.【醫學】消散，消退。 a nitrate of silver solution 硝酸銀溶液。 chemical solution 化學溶解。 mechanical solution 機械溶解。 “a set“ 中文翻譯： 一局; 一套；一副“a set of“ 中文翻譯： 套/組/副; 一串; 一套,一副; 一組“be set in“ 中文翻譯： 以…為背景/場景“be set to“ 中文翻譯： 認真開始干“for a set“ 中文翻譯： 元一套“in set“ 中文翻譯： 成套“not set“ 中文翻譯： 不能設置“on the set“ 中文翻譯： 在片場“s-set“ 中文翻譯： 海鮮“set“ 中文翻譯： SET ＝safe electronic transaction 安全電子交易〔指用信用卡通過因特網支付款項的商業交易〕。 n. 【埃及神話】賽特〔古埃及神話中獸頭人身象征邪惡的神〕。 vt. (set; setting) 1.放；擱；貼；靠。 set a cup on the table 把杯子放在桌上。 set it against the wall 把它靠在墻上。 set eyes on 注視；碰見。 2.安置；布置；安排；設置；裝置。 set a guard at the gate 派衛兵守門。 3.使固定。 set a butterfly 釘住蝴蝶(做標本)。 set a cutting tool on a carriage 把切削刀具固定在刀架上。 4.鑲；嵌。 set a jewel 鑲寶石。 an island set in a sea of silver 鑲在銀色海面上的一個島。 5.種植。 set seeds [plants] 播種；種(植物)。 6.揚(帆)；扯上；扯開。 set sail 張帆；開船。 7.設(陷阱)；張(羅網)。 8.點燃；放(火)。 set fire to 放火。 9.簽(字)；蓋(章)。 set seal [signature] to the deed 在證書上蓋章[簽字]。 set one's hand to a document 在文件上簽字。 10.樹立(榜樣、模范)。 set an example 樹立榜樣；示范；以身作則。 set the fashion 樹立新型樣板；開風氣。 11.規定；約定；擇定(日子等)；指定(地點)；劃定(界限)；確定；決定；制定；頒布。 set a price 定價錢。 set the atomic mass of hydrogen at 1 atomic mass unit 把氫原子量定為一個原子量單位。 12.創造(記錄)。 set a new production record 創造新的生產記錄。 13.使堅固；使凝結；弄硬；使牢固。 set the white of an egg by boiling it 煮蛋使蛋白凝固。 Cold sets jellies. 果子凍[肉凍]因冷而凍結。 14.使(頭發)成波浪形；卷(頭發)。 set one's hair 把頭發卷[作]成波浪形。 15.接骨；整骨。 set the broken bone 正骨。 16.銼(鋸齒)；搶(梯刀)；對(鐘、表)，撥準(鐘的指針)；校正(儀器)；調整。 set a clock [watch] by the TV time signal 按電視臺的報時對鐘[表]。 set an alarm clock (for five a. m.) 把鬧鐘撥到早晨五點。 17.提出(問題，任務)；出(題目)；指定(作業)。 set an examination paper 出考試題目。 18.排(鉛字)。 19. 使從事；使…[指定]做某事[某動作]。 set him to the task 使[指定]他做那件工作。 20.專心；集中；傾注。 set one's heart on ... 一心要；迷戀。 set one's affections on 愛上；熱愛。 21.使處于某種狀態。 set his mind at ease 使他安心。 set a question at rest 使問題得到解決。 set machines in motion 使機器開動。 set the bell a-ring 把鐘敲響。 set right 矯正；弄正。 set things going 使事情進行下去。 set affairs in order 使事情就緒。 22.為(詩、詞)譜曲；改寫(樂曲)；配(布景)。 set piano music for the violin 改鋼琴曲成小提琴曲。 set word to music 將歌詞編成曲子。 23.使(母雞)孵蛋。 set a hen 使一母雞孵蛋。 24.〔橋牌〕打敗(對手)。 25.使朝某一方向。 set one's feet homeward 朝回家的方向走。 26.使移動。 set a match of fire 以火柴點火。 set a pen to paper 提筆寫字，著書立說。 27.〔方言〕使坐下。 28.釋放。 set a prisoner free 釋放犯人。 29.(獵狗)以鼻指著(獵物)以指示其位置。 30.使(顏色)固著。 vi. 1.(太陽等)(沉)落；偏西。 The sun has set. 太陽落了。 His star has set. 他的命運完了。 2.(液體等)凝固；凝結；固定。 The jelly has set. 肉凍凝結起來了。 His character has set. 他的性格固定下來了。 His face set. 他繃起面孔。 Her eyes set. 她的眼睛瞪住了。 3. 著手；從事。 4.開始活動；開始工作。 5.(水、風等)流向；吹向；(感情、意見等)傾向。 The tide sets in [out]. 潮水漲[退]了。 6.結果實；結子兒。 7.植樹；插樹。 8.(母雞)孵卵。 9.(衣服等)合身；適合。 The coat sets badly. 這件上衣不合身。 10.(獵犬)站住指示獵物所在。 11.(跳舞)采取面對面姿勢。 12.(骨)接合；(金屬)永久變形。 13.〔方言〕坐。 14.(頭發)卷成波浪形。 15.攻擊 (upon)。 16.(顏色)固著。 be hard set 1. 處于為難境地 (for to)。 2. (蛋)在孵化中。 3. 感到饑餓。 be sharp set 1. 很餓。 2. 渴求。3. (臉)表情嚴肅。 set a case 假定。 set a limit to (規定)限制；縮減(冗費)。 set a thief [rogue] to catch a thief [rogue] 以毒攻毒。 set about 1. 開始；下手；著手。 2. 〔口語〕攻擊。 3. 散布(謠言)。 4. 〔俚語〕連接毆打；亂打。 set abroad 散布；推廣；宣揚；公開發表。 set afloat 1. 落水；使下水。 2. 著手；開始。 set against 1. 比較；對照。2. 使對抗；使反對；使猜忌。 3. 使平衡。4. 使不和；離間。 5. 賭。 set agoing [going] 使動；開動；使開行。 set apart 1. 留出(充當別用)。 2. 分開；分離。 set aside 撥出；擱置；駁回。 set at 襲擊；嗾使(狗等)。 set at ease [rest] 使安心；安慰；撫慰。 set at large [liberty] 釋放；解放。 set at odds, set at variance 挑撥離間；使爭吵；使打架。 set back 1. 阻礙；阻止。 2. 使挫折；使退步。 3. 撥慢(鐘表的方針)。 4. 〔美口〕使(某人)花錢 (How much did it set you back 它使你花了多少錢？)。 set before 1. 擺在…前面；拿出；盛出(食物)；(把酒)斟出。 2. 告訴(事實等)；陳述；說明；勸導。 set by 1. 擱在一旁；拿開；擱起；藏起；保留。 2. 尊重；珍重。 set by the compass 按羅針儀測定(方位)。 set by the heels 1. 上腳鐐。 2. 拘禁；監禁；逮捕；使不能活動[無能，無用]。 3. 弄翻；弄倒。 set down 1. 擱下；丟下。 2. 讓乘客下車；把東西卸下車。 3. 記入；登記。 4. 定；設；制定。 “set a“ 中文翻譯： 一套表“set as“ 中文翻譯： 設定為; 設置為
solution treatment |
|
One is , based on answering the above open problem on a finite dimensional euclidean space by means of partially ordered theory , to research the existence of solutions , global error bounds of proximal solutions and sensitivity of parametric unique solutions and present a class of variable - parameter three - step iterative algorithms for generalized set - valued variational inclusion problems by using - resolvent operator of set - valued mapping . two is to consider the convexity , closedness and boundedness of the solution set of general set - valued variational inclusion problems and the sensitivity of the parametric solution set by means of graphical convergence theory . three is to discuss directly the existence of solutions by using analytical methods for set - valued mixed quasi - variational - like inequalities and suggest a class of direct variable - parameter three - step iterative algorithms for solving generalized set - valued variational inclusions 研究分有三個方面：一是借助于偏序理論在有限維歐氏空間中解決了上述公開問題，在此基礎上利用集值映射的-預解算子，研究了廣義集值變分包含問題解的存在性、逼近解的全局誤差界、參數唯一解的靈敏性，并提出了一類變參數三步迭代算法；二是借助于圖收斂理論研究了一般集值變分包含問題解集的凸性、閉性和有界性以及參數解集的靈敏性；三是用分析的方法直接討論了集值混合擬類變分不等式問題解的存在性并提出了一類求解廣義集值變分包含問題的直接變參數三步迭代算法。 |
|
The existence conditions of unique solutions are discussed by using - reslovent operators for set - valued mixed quasi - variational - like inequality and generalized set - valued variational inclusion problems on finite dimensional euclidean spaces ; respectively . the problem that under what conditions the solution set is nonempty ( not necessarily unique solution ) is ?利用-預解算子在有限維空間中探討了集值混合擬類變分不等式問題和廣義集值變分包含問題存在唯一解的條件；利用分析的方法在實hilbert空間中討論了集值混合擬類變分不等式問題解集的非空性(不一定只有唯一解) 。 |
|
In this paper , a concept of strictly efficient solution of the optimization problem for a set - valued mapping is introduced . it is proved that strictly efficient point set of the objective space is connected when objective function is cone convex - like , and that if objective function is cone convex set - valued mapping , then strictly efficient solution set is also connected . as an interesting application of the results in this paper , the connectedness of super efficient solution sets is discussed 本文對集值映射最優化問題引入嚴有效解的概念.證明了當目標函數為錐類凸的集值映射時，其目標空間里的嚴有效點集是連通的；若目標函數為錐凸的集值映射時，其嚴有效解集也是連通的.作為應用，討論了超有效解集的連通性 |
|
The algorithm begins horn a conversion of the weight of link cost with an initial solution set in terms of delay - satisfied multicast trees provided for ga , then the expensive tree links are substituted iteratively with the cheaper ones during the crossover operation so as to get the multicast tree satisfying delay constraint with lowest cost 算法從鏈路代價權值轉化開始，以滿意的時延樹為遺傳算法的初始解集，然后在交叉操作過程中不斷地用低鏈路代價的邊代替樹中高鏈路代價的邊，以求得滿足鏈路代價最優的組播樹。 |
|
In the case of infinite domains , it is proven that there exists a maximal solution x “ of a @ x = b such that x * x for every solution x of a @ x = b if the solution set of a @ x = b is unempty and b has an irredundant completely meet - irreducible decomposition . it is also identified that there exists a maximal solution x * of a @ x = b such that x * x for every solution x of a @ x = b if the solution set of a @ x = bis unempty and every component of b is dual - compact and has an irredundant finite - decomposition . in the end , a necssary and sufficient condition that there exists a maximal solution x * of a @ x = bsuch that x * x for every solution x of a @ x = b is given when the solution set of a @ x = b is unempty 當論域為無限集時，證明了如果方程a @ x = b有解且b有不可約完全交既分解，則對方程a @ x = b的每一個解至少存在一個大于等于它的極大解；進一步證明了如果方程a @ x = b有解且b的每一個分量為對偶緊元并有不可約有限交分解，則對方程a @ x = b的每一個解存在一個大于等于它的極大解；最后給出了對方程a @ x = b的每一個解存在一個大于等于它的極大解的一個充要條件及[ 0 ， 1 ]格上方程a @ x = b的解集中存在極大解的一個充要條件。 |
|
For affirmming holding this property , the existing common assumptions are that p is bounded or the leader ' s objective function is bounded from below over p , etc . these assumptions are not the necessary and sufficient conditions for this property to hold , and also p is not the feasible solution set for the leader ' s programming of the problem , so such assumptions are quite strict , for the fractional bilevel programming problem , literatures concerned with the exact penalty function formulation are few 為了保證這一性質，一般就要求假設允許集p有界或者外層目標函數在p上有下界。而允許集p并非是所研究問題的外層規劃的可行集，上述有界性假設也并非是上述性質存在的充要條件，這樣的假設條件是比較嚴格的。對于分式雙層規劃問題的恰當罰函數的研究則少之又少了。 |
|
The method proposed in this thesis do well in solving the problems of multi - damping - ratio - spectra simulation . it is convenient to obtain the pareto optimal solution set of the multi - object question by using implicit parallel genetic algorithms and the method can meet the practical needs for simulating ground motions coinciding with multi - damping - ratio - spectra in seismic design . the crossing rate and variance rate are important parameters of genetic algorithms which affect the rate of convergence , the adapting rate of cross and variation in this paper can auto - adapt and according to stand or fall of current sample , it assures the sample approach to the pareto optimal solution set in fast convergent speed 較好地解決多阻尼比反應譜擬合問題；本文方法通過一次運行就能獲得一組具有集系特性的地震動，在擬合多阻尼比反應譜的人造地震波集系的仿真方面有傳統方法所不能比擬的優勢，產生的人造波或人造波集系可滿足工程抗震設計需要；在遺傳算法中，交叉概率和變異概率是影響收斂速度的重要參數，本文采用的改進自適應交叉概率和變異概率，可以根據當前樣本的好壞程度來自動地選擇適當的交叉概率和變異概率，以保證算法始終以較好的速度向pareto最優解集逼近。 |
|
Next , on the basis of the set of it , this paper respectively discusses properties of refined equilibrium solution sets , by defining the super refined equilibrium solution , refined equilibrium solution above ( ) - level , stable number , ( ) - similar super refined equilibrium solution , etc . consequently , player k can obtain the attainment degree of aggregated fuzzy goals at least dkp in the fuzzy game determined by p . finally , by comparing dkp , player k can determines his super optional coalition 然后，在聯盟精練平衡解集的基礎上，通過定義最優精練平衡解、水平上的精練平衡解、穩定數、 ?近最優精練平衡解等概念，具體分析討論精練平衡解集的性質，得到局中人k在由p所確定的模糊對策中的聯合模糊目標實現度的至少值- - d _ k ~ p 。通過比較d _ k ~ p ，最終確定了局中人k的最優選擇聯盟。 |
|
The paper follows the principles of telecommunication management network ( tmn ) , and absorbs some advanced ideas from telecommunication management forum ( tmf ) . a whole solution sets related to several key issues in the network management system is given . according to authors “ long period experiemce in this area , the solution combines the tmn principles with real status of china mobile , provide a practicable nms solution to heilongjiang province 本文以tmn ( telecommunicationmanagementnetwork )規范為藍本，參照了tmf ( telecommunicationmanagementforum )的一些最新思想，結合作者多年來在移動電信網管領域的經驗，將tmn理論與中國移動的運行維護體制進行有效地結合，提出了一套針對黑龍江省移動網絡管理的解決方法，并且進行了實際工程實施。 |
|
Recently , yamashita and fukushima [ 4 ] show that the sequence produced by the levenberg - marquardt method converges quadraticlly to the solution set of the equations , if the parameter is chosen as the quadratic norm of the function and under the weaker condition than the nonsingularity that the function provides a local error bound near the solution . however , the quadratic term has some unsatisfactory properties 最近yamashita & fukushima [ 4 ]提出，在弱于非奇異性條件的局部誤差界條件下，如果選取的迭代參數為當前迭代點處函數值模的平方，則levenberg - marquardt方法產生的迭代點列二階收斂于方程組的解集。 |
|
In particular , some properties of the solution set of the equation a 0 x = b ( where “ 0 “ denotes sup - inf composition ) are given when the domain is an infinite set on lattice [ 0 , 1 ] . prom the coefficients of the equation aqx = 6 , it is showed that a sufficient and necessary condition that the solution set is nonempty and one for existence of an attainable solution or an unattainable solution 特別在[ 0 ， 1 ]格上對無限論域方程a ? x = n (其中“ ? ”表示sup - inf合成)的解集的性質作了討論，僅從方程的系數出發給出了方程解集非空的充要條件以及存在可達解或不可達解的充要條件。 |
|
This ph . d . thesis - firstly considers the real asymmetric , real symmetric , bisym - metric , and symmetric and skew antisymmetric matrix extension problems constrained by the matrix inverse problem ax = b . and also considers , in the solution set , of the corresponding matrix extension problems , the optimal approximation solution to a given matrix a * . the necessary and sufficient conditions for the existence of and the expressions for the above problems are derived , and the numerical algorithm and examples to solve the problems are also given 首次提出并討論了矩陣反問題ax = b約束下實矩陣、實對稱矩陣、雙對稱矩陣和對稱次反對稱矩陣的擴充問題，討論了在其解集合中與給定矩陣a ~ *的最佳逼近問題，得到了問題的解存在的條件及通式的表示，給出求解問題的數值算法和數值例子。 |
|
Motivated by this fact and peng ' s promising result , we utilize a special algebraic transformation , namely logarithmic transformation , to establish a non - infeasible long - step primal - dual path following algorithm . this algorithm arrives at the primal - dual solution set along the steepest descent direction of primal - dual 第七章，通過構造一個新的鄰近度量函數，提出一個具有自調節功能的原一對偶路徑跟蹤內點算法，并將其與線性規劃軟件lipsol和彭等人的m 。 |
|
When / is infinite and 6 is a compact element and with an irredundant finite join - decomposition , it is showed that a sufficient and necessary condition that the solution set is nonempty . it is also proved that there exists a minimal solution if the solution set of the equation sup t ( ai , xi ) = b is nonempty 當論域為無限集， b為緊元且有不可約有限并分解時，給出了解集非空的充要條件，證明了如果方程sup _ ( i i ) ( a _ i ， x _ i ) = b有解，則一定存在極小解。 |
|
Secondly , the penalty coefficient may converge to infinity in many situations when the iterative point is closely near the bound of feasible set , while the parameters are bounded if the solution set of constrained optimization is nonempty , which is available for numerical computation 另外在很多情況下，罰函數法中的罰因子當迭代點接近可行域邊界時趨于無窮大，而參數控制算法中，只要約束優化問題有最優解，則參數是有界的，這對數值計算是有利的。 |
|
In the end , when the domain is finite , b is a meet - irreducible element or 6 has an irredundant finite meet - decomposition , a sufficient and necessary condition that the solution set is nonempty is given and the number of distinct minimal solutions is formulated 最后，當論域為有限集， b為交既約元或有不可約有限交分解時，給出了方程inf _ ( i j ) ( a _ j ， x _ j ) = b解集非空的充要條件以及極大元的個數公式。 |
|
The necessary and sufficient condition for centrosymmetric solution of matrix equation was presented and general solutions were obtained . the optimal approximation solution to a given matrix was provided in the solution set 先討論一類矩陣方程存在中心對稱解的充分必要條件,給出解的一般表達式,并在解集合中給出了與給定矩陣的最佳逼近解。 |
|
Based on the solution set , the optimal approximation to a given matrix is constructed , and the necessary and sufficient conditions for the solvability of the problem are given and the expression for the solution is provided 討論了用雙中心矩陣反問題的解構造給定矩陣的最佳逼近問題，給出該問題有解的充分必要條件和解的表達式。 |
|
Secondly , for a more general matrix equation in composition , we obtain another equivalent condition for the solvability of this equation and give an equivalent characterization to the solution set of the equation 第二,對于一般情況下的型矩陣方程,本文給出其可解的另一個等價條件,同時對其解集作了一個等價性描述 |